Plaintext Awareness via Key Registration
نویسندگان
چکیده
In this paper, we reconsider the notion of plaintext awareness. We present a new model for plaintext-aware encryption that is both natural and useful. We achieve plaintext-aware encryption without random oracles by using a third party. However, we do not need to trust the third party: even when the third party is dishonest, we still guarantee security against adaptive chosen ciphertext attacks. We show a construction that achieves this definition under general assumptions. We further motivate this achievement by showing an important and natural application: giving additional real-world meaningfulness to the DolevYao model.
منابع مشابه
New tools in cryptography: mutually independent commitments, tweakable block ciphers, and plaintext awareness via key registration
Cryptographic primitive research comprises much of the body of modern cryptographic research. This kind of research aims to produce useful primitives – building blocks with which we can design systems to enforce complex and subtle security requirements. Cryptographic primitive research often involves noticing a new problem that needs a simple solution, or a different way of setting up a problem...
متن کاملRelations Among Notions of Plaintext Awareness
We introduce a new simplified notion of plaintext awareness, which we term PA2I, and show that this is equivalent to the standard definition of PA2 plaintext awareness for encryption schemes that satisfy certain weak security and randomness requirements. We also show that PA2 plaintext awareness is equivalent to PA2+ plaintext awareness under similar security and randomness requirements. This p...
متن کاملSecret Key Awareness Security Public Key Encryption Scheme
In this paper, firstly, we introduce a new security definition called secret key awareness security which is to guarantee anyone generating the public key to know the corresponding secret key. Following, we give a concrete implementing for secret key awareness security. Secondly, we present two applications: one is in plaintext awareness security cryptosystem, and another is in certificatless p...
متن کاملStrong Knowledge Extractors for Public-Key Encryption Schemes
Completely non-malleable encryption schemes resist attacks which allow an adversary to tamper with both ciphertexts and public keys. In this paper we introduce two extractor-based properties that allow us to gain insight into the design of such schemes and to go beyond known feasibility results in this area. We formalise strong plaintext awareness and secret key awareness and prove their suitab...
متن کاملTrading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security
In PKC 2014, Dachman-Soled showed a construction of a chosen ciphertext (CCA) secure public key encryption (PKE) scheme based on a PKE scheme which simultaneously satisfies a security property called weak simulatability and (standard model) plaintext awareness (sPA1) in the presence of multiple public keys. It is not well-known if plaintext awareness for the multiple keys setting is equivalent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003